An exact exponential branch-and-merge algorithm for the single machine total tardiness problem

A hybrid algorithm for the single-machine total tardiness problem

We propose a hybrid algorithm based on the Ant Colony Optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP -hard single-machine scheduling problem to minimize the total job tardiness. The hybrid algorithm has the same running time as that of ACO. We conducted extensive computational experiments to test the performance of the hybrid algorithm...

A Branch-and-bound Algorithm for Single Machine Total Tardiness Problem with Release Dates

This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...

On the single machine total tardiness problem

In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

New Instances for the Single Machine Total Weighted Tardiness Problem

Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art algorithms. This paper describes the proposition of two classes of novel instances for the single machine total weighted tardiness problem. In resp...